Heuristic Solutions for a Mapping Problem in a TV-Anytime Server Network

نویسندگان

  • Xiaobo Zhou
  • Reinhard Lüling
  • Li Xie
چکیده

This paper presents a novel broadband multimedia service called TV-Anytime. The basic idea of this service is to store broadcast media assets onto media server systems and allow clients to access these streams at any time. We propose a hierarchical structure of a distributed server network to support a high quality TV-anytime service. A key issue, how to map the media assets onto such a hierarchical server network is addressed and formalized as a combinatorial optimization problem. In order to solve this optimization problem, a set of heuristic solutions by use of a parallel simulated annealing library is proposed and verified by a set of benchmark instances. Finally, the TV Cache is presented as a prototype of a scalable TV-Anytime system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving a Media Mapping Problem in a Hierarchical Server Network with Parallel Simulated Annealing

Advances in storage and high-speed broadband communication network technologies are making it feasible to design and implement distributed scalable Video-onDemand server networks. In this paper, a hierarchical structure for a server network is proposed to support a metropolitan TV-Anytime service. A key issue, how to map the media assets onto such a hierarchical server network, is addressed in ...

متن کامل

Dynamic adaptive mapping of videos in a hierarchical TV-Anytime server network

In this paper, we propose a hierarchical architecture of server network for supporting a large-scale TV-Anytime system. We present and formulate various policies used for the effective mapping of videos in the runtime of the TV-Anytime system. A predictive assignment policy is presented to periodically determine the mapping of videos to the server network. Furthermore, we present an adaptive re...

متن کامل

A CSA Method for Assigning Client to Servers in Online Social Networks

This paper deals with the problem of user-server assignment in online social network systems. Online social network applications such as Facebook, Twitter, or Instagram are built on an infrastructure of servers that enables them to communicate with each other. A key factor that determines the facility of communication between the users and the servers is the Expected Transmission Time (ETT). A ...

متن کامل

Application of Particle Swarm Optimization and Genetic Algorithm Techniques to Solve Bi-level Congestion Pricing Problems

The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...

متن کامل

Adaptive online scheduling of tasks with anytime property on heterogeneous resources

An acceptable response time of a server is an important aspect in many client-server applications; this is evident in situations in which the server is overloaded by many computationally intensive requests. In this work, we consider that the requests, or in this case tasks, generated by the clients are instances of optimization problems solved by anytime algorithms, i.e. the quality of the solu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000